Semideenite Programming and Graph Equipartition
نویسنده
چکیده
Semideenite relaxations are used to approximate the problem of partitioning a graph into equally sized components. The relax-ations extend previous eigenvalue based models, and combine semidee-nite and polyhedral approaches. Computational results on graphs with several hundred vertices are given, and indicate that semideenite relax-ations approximate the equipartition problem quite well.
منابع مشابه
Semide nite Programming and Graph
Semideenite relaxations are used to approximate the problem of partitioning a graph into equally sized components. The relaxations extend previous eigenvalue based models, and combine semideenite and polyhedral approaches. Computational results on graphs with several hundred vertices are given, and indicate that semideenite relaxations approximate the equipartition problem quite well.
متن کاملA Toolbox for a Cutting { Plane Approachbased on Semidefinite
CUTSDP is a package of C programs containing an implementation of a cutting plane approach based on semideenite programming. This manual describes the package itself and also three applications: max-cut, graph bisection, and graph equipartition.
متن کاملSemideenite Programs and Combinatorial Optimization
Outline 1. Introductory examples: Shannon capacity and maximum cuts. 2. Preliminaries: linear programming, semideenite matrices. 3. General properties of semideenite programs: equivalent forms, Farkas Lemma, Duality Theorem, Ellipsoid method, Interior point method. 4. Getting semideenite programs I: eigenvalues of graphs and the method of variables. 5. Getting semideenite programs II: geometric...
متن کاملSemideenite Programs and Combinatorial Optimization
Outline 1. Introductory examples: Shannon capacity and maximum cuts. 2. Preliminaries: linear programming, semideenite matrices. 3. General properties of semideenite programs: equivalent forms, Farkas Lemma, Duality Theorem, Ellipsoid method, Interior point method. 4. Getting semideenite programs I: eigenvalues of graphs and the method of variables. 5. Getting semideenite programs II: geometric...
متن کاملResearch Report and Proposal
when I joined the Max Planck Institut as a post-doctoral fellow, I have been working at Semideenite Programming and its applications to Approximation Problems. The techniques from Semideenite Programming have proved useful in the design of good approximation algorithms as is evinced by the ground breaking paper of Goemans and Williamson on Max Cut and Max Sat 13]. Since then several researchers...
متن کامل